A Complete Fragment of Higher-Order Duration µ-Calculus

نویسنده

  • Dimitar P. Guelev
چکیده

the governments of the People's Republic of China and Portugal through a contribution to the UNU Endownment Fund. As well as providing two-thirds of the endownment fund, the Macau authorities also supply UNU/IIST with its ooce premises and furniture and subsidise fellow accommodation. The mission of UNU/IIST is to assist developing countries in the application and development of software technology. UNU/IIST contributes through its programmatic activities: 1. Advanced development projects, in which software techniques supported by tools are applied, 2. Research projects, in which new techniques for software development are investigated, 3. Curriculum development projects, in which courses of software technology for universities in developing countries are developed, 4. University development projects, which complement the curriculum development projects by aiming to strengthen all aspects of computer science teaching in universities in developing countries, 5. Courses, which typically teach advanced software development techniques, 6. Events, in which conferences and workshops are organised or supported by UNU/IIST, and 7. Dissemination, in which UNU/IIST regularly distributes to developing countries information on international progress of software technology. Fellows, who are young scientists and engineers from developing countries, are invited to actively participate in all these projects. By doing the projects they are trained. At present, the technical focus of UNU/IIST is on formal methods for software development. UNU/IIST is an internationally recognised center in the area of formal methods. However, no software technique is universally applicable. We are prepared to choose complementary techniques for our projects, if necessary. UNU/IIST produces a report series. Reports are either Research R , Technical T , Compendia C or Administrative A. They are records of UNU/IIST activities and research and development achievements. Many of the reports are also published in conference proceedings and journals. Abstract The paper presents an extension HDC of Higher-order Duration Calculus (HDC,,ZGZ99]) by a polyadic least xed point () operator and a class of non-logical symbols with a nite variability restriction on their interpretations, which classiies these symbols as intermediate between rigid symbols and exible symbols as known in DC. The operator and the new kind of symbols enable straightforward speciication of recursion and data manipulation by HDC. The paper contains a completeness theorem about an extension of the proof system for HDC by axioms about and symbols of nite variability for a class of simple HDC formulas, which extends the original class of simple DC formulas introduced in DW94]. The new class extends …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus

We provide a characterization theorem, in the style of van Benthem and Janin-Walukiewicz, for the alternation-free fragment of the modal μ-calculus. For this purpose we introduce a variant of standard monadic second-order logic (MSO), which we call well-founded monadic second-order logic (WFMSO). When interpreted in a tree model, the second-order quantifiers of WFMSO range over subsets of conve...

متن کامل

$\mu$-calculus on data words

We study the decidability and expressiveness issues of µ-calculus on data words and data ω-words. It is shown that the full logic as well as the fragment which uses only the least fixpoints are undecidable, while the fragment containing only greatest fixpoints is decidable. Two subclasses, namely BMA and BR, obtained by limiting the compositions of formulas and their automata characterizations ...

متن کامل

The modal µ-calculus hierarchy over restricted classes of transition systems

We study the strictness of the modal μ-calculus hierarchy over some restricted classes of transition systems. First, we show that the hierarchy is strict over reflexive frames. By proving the finite model theorem for reflexive systems the same results holds for finite models. Second, we prove that over transitive systems the hierarchy collapses to the alternation-free fragment. In order to do t...

متن کامل

A Higher-Order Duration Calculus and Its Completeness

This paper studies how to describe the real-time behaviour of programs using Duration Calculus. Since program variables are interpreted as functions over time in real-time programming, and it is inevitable to introduce quantifications over program variables in order to describe local variable declaration and declare local channel and so on, therefore, to establish a higher-order duration calcul...

متن کامل

Completeness and Decidability of a Fragment of Duration Calculus with Iteration

Duration Calculus with Iteration (DC∗) has been used as an interface between original Duration Calculus and Timed Automata, but has not been studied rigorously. In this paper, we study a subset of DC∗ formulas consisting of so-called simple ones which corresponds precisely with the class of Timed Automata. We give a complete proof system and the decidability results for the subset.

متن کامل

A decision procedure for alternation-free modal µ-calculi

The alternation-free fragment of the propositional modal μ-calculus (AFμ) allows less complex decision procedure for satisfiability judgment than the full μ-calculus, yet it still has strong expressive power. In this paper, we present a concrete decision procedure with its complexity for AFμ enriched by features of nominals, backward modalities, and functional modalities. While AFμ with all thr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000